Finding a majority ball with majority answers
نویسندگان
چکیده
منابع مشابه
Finding a majority ball with majority answers
Suppose we are given a set of n balls {b1, . . . , bn} each colored either red or blue in some way unknown to us. To find out some information about the colors, we can query any triple of balls {bi1 , bi2 , bi3}. As an answer to such a query we obtain (the index of) a majority ball, that is, a ball whose color is the same as the color of another ball from the triple. Our goal is to find a non-m...
متن کاملRandomized Algorithms for Finding a Majority Element
Given n colored balls, we want to detect if more than bn/2c of them have the same color, and if so find one ball with such majority color. We are only allowed to choose two balls and compare their colors, and the goal is to minimize the total number of such operations. A well-known exercise is to show how to find such a ball with only 2n comparisons while using only a logarithmic number of bits...
متن کاملThe majority game with an arbitrary majority
The k-majority game is played with n numbered balls, each coloured with one of two colours. It is given that there are at least k balls of the majority colour, where k is a fixed integer greater than n/2. On each turn the player selects two balls to compare, and it is revealed whether they are of the same colour; the player’s aim is to determine a ball of the majority colour. It has been correc...
متن کاملComputing majority with low-fan-in majority queries
In this paper we examine the problem of computing majority functionMAJn on n bits by depthtwo formula, where each gate is a majority function on at most k inputs. We present such formula that gives the first nontrivial upper bound for this problem, with k = 2 3n + 4. This answers an open question in [7]. We also look at this problem in adaptive setting — when we are allowed to query for value o...
متن کاملMajority Consensus and the Local Majority Rule
we only show one further result that emphasizes our point that understanding LMP is fundamental to understanding any generalization of this process. A simple generalization of the local majority process would allow vertex v to have some resistivity towards color switch. Formally, for a nonnegative integer kv, we de ne a kv-local majority rule for vertex v: ct+1 v = ( ctv if jfw 2 Nv : ctw = ctv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2015
ISSN: 1571-0653
DOI: 10.1016/j.endm.2015.06.047